翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

predicative programming : ウィキペディア英語版
predicative programming
Predicative programming is a methodology for program specification and refinement. The central idea of predicative programming is that each specification is a predicate (generally written as a boolean expression) that is true of acceptable behaviours and false of unacceptable behaviours. It follows that refinement is reversed implication universally quantified over behaviours:
:(P\sqsubseteq Q)\equiv (\forall b\cdot Q\Rightarrow P)
Commands in a programming language are considered to be a special case of specifications—special only because they are compilable. For example in an environment where the program variables are x, y, and z, the command x:=y+1\,\! is considered equivalent to the predicate (represented here by a boolean expression)
:x' = y+1 \land y'=y \land z'=z
in which x, y, and z represent the initial values of the program variables and x', y', and z' represent the final values of the program variables. Thus
:x' > y \sqsubseteq x := y+1
== Bibliography ==

* E.C.R. Hehner, ''a Practical Theory of Programming'', Springer-Verlag 1993. Most recent edition online at (a Practical Theory of Programming ).

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「predicative programming」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.